Double-rooted lower canines.
نویسندگان
چکیده
منابع مشابه
Brief communication: two-rooted lower canines--a European trait and sensitive indicator of admixture across Eurasia.
With the exception of Carabelli's trait, the European dentition is better known for the morphological traits that it does not exhibit rather than the ones that it does. One root trait, however, runs counter to the characterization of reduced and simplified European crowns and roots. Although a rare trait in general, two-rooted lower canines are much more common in Europeans than in any other re...
متن کاملBi-rooted Primary Maxillary Canines: A Case Report
This report presents a rare case of bi-rooted primary maxillary canines. A 6-year-old girl presented at the Department of Pediatric Dentistry, Faculty of Dentistry, Mashhad University of Medical Sciences, Iran, with the chief complaint of pain in the lower right quadrant of her dentition. Radiographic examination revealed bifurcation of primary maxillary canine roots. This report discusses the ...
متن کاملbi-rooted primary maxillary canines: a case report
this report presents a rare case of bi-rooted primary maxillary canines. a 6-year-old girl presented at the department of pediatric dentistry, faculty of dentistry, mashhad university of medical sciences, iran, with the chief complaint of pain in the lower right quadrant of her dentition. radiographic examination revealed bifurcation of primary maxillary canine roots. this report discusses the ...
متن کامل1 Lower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملLower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese Journal of Oral Biology
سال: 1988
ISSN: 0385-0137
DOI: 10.2330/joralbiosci1965.30.825